Computing the composition factors of a permutation group in polynomial time
نویسندگان
چکیده
منابع مشابه
Computing the composition factors of a permutation group in polynomial time
Given generators for a group of permutations, it is shown that generators for the subgroups in a composition series can be found in polynomial time. The procedure also yields permutation representations of the composition factors. 1) Research supported by National Science Foundation Grants DCR-8403745 and DCR-8609491
متن کاملThe Cycle Polynomial of a Permutation Group
The cycle polynomial of a finite permutation group G is the generating function for the number of elements of G with a given number of cycles:
متن کاملa time-series analysis of the demand for life insurance in iran
با توجه به تجزیه و تحلیل داده ها ما دریافتیم که سطح درامد و تعداد نمایندگیها باتقاضای بیمه عمر رابطه مستقیم دارند و نرخ بهره و بار تکفل با تقاضای بیمه عمر رابطه عکس دارند
Computing the Galois group of a polynomial
This article outlines techniques for computing the Galois group of a polynomial over the rationals, an important operation in computational algebraic number theory. In particular, the linear resolvent polynomial method of [6] will be described.
متن کاملRecognizing permutation functions in polynomial time
Let Fq be a finite field and f(x) ∈ Fq(x) be a rational function over Fq. The decision problem PermFunction consists of deciding whether f(x) induces a permutation on the elements of Fq. That is, we want to decide whether the corresponding map f : Fq 7→ Fq defined by a 7→ f(a) is a bijective mapping or not. This problem was known to be in ZPP but not known to be in P. We resolve the complexity ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 1987
ISSN: 0209-9683,1439-6912
DOI: 10.1007/bf02579204